Acyclicity and Coherence in Multiplicative Exponential Linear Logic
نویسنده
چکیده
We give a geometric condition that characterizes MELL proof structures whose interpretation is a clique in non-uniform coherent spaces: visible acyclicity. We define the visible paths and we prove that the proof structures which have no visible cycles are exactly those whose interpretation is a clique. It turns out that visible acyclicity has also nice computational properties, especially it is stable under cut reduction.
منابع مشابه
Yet Another Correctness Criterion for Multiplicative Linear Logic with MIX
A new correctness criterion for discriminating Proof Nets among Proof Structures of Multiplicative Linear Logic with MIX rule is provided. This criterion is inspired by an original interpretation of Proof Structures as distributed systems, and logical formulae as processes. The computation inside a system corresponds to the logical ow of information inside a proof, that is, roughly, a distribut...
متن کاملThe relational model is injective for Multiplicative Exponential Linear Logic (without weakenings)
We show that for Multiplicative Exponential Linear Logic (without weakenings) the syntactical equivalence relation on proofs induced by cut-elimination coincides with the semantic equivalence relation on proofs induced by the multiset based relational model: one says that the interpretation in the model (or the semantics) is injective. We actually prove a stronger result: two cut-free proofs of...
متن کاملOn Linear Logic Planning and Concurrency
We present an approach to linear logic planning where an explicit correspondence between partial order plans and multiplicative exponential linear logic proofs is established. This is performed by extracting partial order plans from sound and complete encodings of planning problems in multiplicative exponential linear logic in a way that exhibits a non-interleaving behavioral concurrency semant...
متن کاملOn the Expressivity of Two Refinements of Multiplicative Exponential Linear Logic
The decidability of multiplicative exponential linear logic (MELL) is currently open. I show that two independently interesting refinements of MELL that alter only the syntax of proofs—leaving the underlying truth untouched— are undecidable. The first refinement uses new modal connectives between the linear and the unrestricted judgments, and the second is based on focusing with priority assign...
متن کاملMusings around the geometry of interaction, and coherence
We introduce the Danos-Régnier category DR(M) of a linear inverse monoid M, as a categorical description of geometries of interaction (GOI) inspired from the weight algebra. The natural setting for GOI is that of a so-called weakly Cantorian linear inverse monoid, in which case DR(M) is a kind of symmetrized version of the classical Abramsky-Haghverdi-Scott construction of a weak linear categor...
متن کامل